A random matching theory
نویسندگان
چکیده
We develop theoretical underpinnings of pairwise random matching processes. We formalize the mechanics of matching, and study the links between properties of the different processes and trade frictions. A particular emphasis is placed on providing a mapping between matching technologies and informational constraints.
منابع مشابه
A Block-Wise random sampling approach: Compressed sensing problem
The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...
متن کاملInstrument dependency of Kubelka-Munk theory in computer color matching
Different industries are usually faced with computer color matching as an important problem. The most famous formula which is commonly used for recipe prediction is based on Kubelka-Munk K-M theory. Considering that spectrophotometer’s geometry and its situation influence the measured spectral values, the performance of this method can be affected by the instrument. In the present study, three ...
متن کاملOn the observational equivalence of random matching
Random matching is often used in economic models as a means of introducing uncertainty in sequential decision problems. We show that random matching processes that satisfy standard proportionality laws are not unique. We give conditions on the payo¤s and transitions functions of sequential decision models that insure that the models are robust to the non-uniqueness of the matching process. Unde...
متن کاملOn Perfect Matchings and Hamiltonian Cycles in Sumsof Random
We prove that the sum of two random trees almost surely possesses a perfect matching and the sum of ve random trees almost surely possesses a Hamiltonian cycle.
متن کاملImproved Streaming Algorithms for Weighted Matching, via Unweighted Matching
We present a (4 + ) approximation algorithm for weighted graph matching which applies in the semistreaming, sliding window, and MapReduce models; this single algorithm improves the previous best algorithm in each model. The algorithm operates by reducing the maximum-weight matching problem to a polylog number of copies of the maximum-cardinality matching problem. The algorithm also extends to p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Games and Economic Behavior
دوره 59 شماره
صفحات -
تاریخ انتشار 2007